Linearizable Eigenvector Nonlinearities

نویسندگان

چکیده

We present a method to linearize, without approximation, specific class of eigenvalue problems with eigenvector nonlinearities (NEPv), where the are expressed by scalar functions that defined quotient linear eigenvector. The exact linearization relies on an equivalent multiparameter problem (MEP) contains solutions NEPv. Due characterization MEPs in terms generalized this provides direct way compute all NEPv for small problems, and it opens up possibility develop locally convergent iterative methods larger problems. Moreover, formulation allows us easily determine number propose two numerical schemes exploit structure linearization: inverse iteration residual iteration. show how symmetry MEP can be used improve reliability reduce computational cost both methods. Two examples verify theoretical results, third example shows potential hybrid scheme is based combination proposed

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An inverse iteration method for eigenvalue problems with eigenvector nonlinearities

Abstract. Consider a symmetric matrix A(v) ∈ Rn×n depending on a vector v ∈ Rn and satisfying the property A(αv) = A(v) for any α ∈ R\{0}. We will here study the problem of finding (λ, v) ∈ R × Rn\{0} such that (λ, v) is an eigenpair of the matrix A(v) and we propose a generalization of inverse iteration for eigenvalue problems with this type of eigenvector nonlinearity. The convergence of the ...

متن کامل

Distributionally Linearizable Data Structures

Relaxed concurrent data structures have become increasingly popular, due to their scalability in graph processing and machine learning applications ([24, 14]). Despite considerable interest, there exist families of natural, high performing randomized relaxed concurrent data structures, such as the popular MultiQueue [27] pattern for implementing relaxed priority queue data structures, for which...

متن کامل

Linearizable ordinary differential equations . ∗

Our purpose in this paper is to study when a planar differential system polynomial in one variable linearizes in the sense that it has an inverse integrating factor which can be constructed by means of the solutions of linear differential equations. We give several families of differential systems which illustrate how the integrability of the system passes through the solutions of a linear diff...

متن کامل

Linearizable Read/Write Objects

We study the cost of using message passing to implement linearizable read write objects for shared memory multiprocessors under various assumptions on the available timing informa tion We take as cost measures the worst case response times for performing read and write operations in distributed implementations of virtual shared memory consisting of such objects and the sum of these response tim...

متن کامل

Abortable Linearizable Modules

We define the Abortable Linearizable Module automaton (ALM for short) and prove its key composition property using the IOA theory of HOLCF. The ALM is at the heart of the Speculative Linearizability framework. This framework simplifies devising correct speculative algorithms by enabling their decomposition into independent modules that can be analyzed and proved correct in isolation. It is part...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications

سال: 2022

ISSN: ['1095-7162', '0895-4798']

DOI: https://doi.org/10.1137/21m142931x